A Modification of Simplified Drum-Buffer-Rope for Re-entrant Flow Shop Scheduling
نویسندگان
چکیده
منابع مشابه
Using simplified drum-buffer-rope for re-entrant flow shop scheduling in a random environment
The traditional simplified drum buffer rope (SDBR) does not consider the application of re-entrant flow shop (RFS) in a random environment which might involve variable processing times and machine breakdowns. This paper proposed a weighted layer production buffer and weighted production buffer to monitor the status of the buffer deviation when applying SDBR in a RFS with non-deterministic param...
متن کاملSolving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملDynamic Drum-Buffer-Rope approach for production planning and control in capacitated flow-shop manufacturing systems
Drum-Buffer-Rope-based production planning and control (PPC) approaches provide production managers with effective tools to manage production disruptions and improve operational performance. The corner stone of these approaches is the proper selection of time-buffers which are considered as exogenously defined constant. However, the majority of real-world manufacturing systems are characterized...
متن کاملDesign of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs
This paper presents a simulated genetic algorithm (GA) model of scheduling the flow shop problem with reentrant jobs. The objective of this research is to minimize the weighted tardiness and makespan. The proposed model considers that the jobs with non-identical due dates are processed on the machines in the same order. Furthermore, the re-entrant jobs are stochastic as only some jobs are requi...
متن کاملA hybrid genetic algorithm for the re-entrant flow-shop scheduling problem
This study considers the production environment of the re-entrant flow-shop (RFS). In a RFS, all jobs have the same routing over the machines of the shop and the same sequence is traversed several times to complete the jobs. The aim of this study is to minimize makespan by using the genetic algorithm (GA) to move from local optimal solution to near optimal solution for RFS scheduling problems. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2010
ISSN: 1812-5638
DOI: 10.3923/itj.2011.40.50